"AVL tree" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "",
        "2": "n",
        "3": "N"
      },
      "expansion": "N",
      "name": "yesno"
    },
    {
      "args": {},
      "expansion": "|",
      "name": "!"
    },
    {
      "args": {
        "1": "en",
        "2": "Georgy Adelson-Velsky"
      },
      "expansion": "Georgy Adelson-Velsky",
      "name": "lang"
    },
    {
      "args": {
        "1": "en",
        "2": "Georgy Adelson-Velsky",
        "wplink": "Georgy Adelson-Velsky"
      },
      "expansion": "Named after Georgy Adelson-Velsky",
      "name": "named-after"
    }
  ],
  "etymology_text": "Named after Georgy Adelson-Velsky and Evgenii Landis, the inventors of this data structure.",
  "forms": [
    {
      "form": "AVL trees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "AVL tree (plural AVL trees)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [],
          "source": "w"
        }
      ],
      "glosses": [
        "A self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one."
      ],
      "id": "en-AVL_tree-en-noun-okp5~Enq",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "self-balancing",
          "self-balancing"
        ],
        [
          "binary search",
          "binary search"
        ],
        [
          "tree",
          "tree"
        ],
        [
          "node",
          "node"
        ],
        [
          "height",
          "height"
        ],
        [
          "child",
          "child"
        ],
        [
          "subtree",
          "subtree"
        ],
        [
          "differ",
          "differ"
        ]
      ],
      "raw_glosses": [
        "(computer science) A self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "wikipedia": [
        "Evgenii Landis"
      ]
    }
  ],
  "word": "AVL tree"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "",
        "2": "n",
        "3": "N"
      },
      "expansion": "N",
      "name": "yesno"
    },
    {
      "args": {},
      "expansion": "|",
      "name": "!"
    },
    {
      "args": {
        "1": "en",
        "2": "Georgy Adelson-Velsky"
      },
      "expansion": "Georgy Adelson-Velsky",
      "name": "lang"
    },
    {
      "args": {
        "1": "en",
        "2": "Georgy Adelson-Velsky",
        "wplink": "Georgy Adelson-Velsky"
      },
      "expansion": "Named after Georgy Adelson-Velsky",
      "name": "named-after"
    }
  ],
  "etymology_text": "Named after Georgy Adelson-Velsky and Evgenii Landis, the inventors of this data structure.",
  "forms": [
    {
      "form": "AVL trees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "AVL tree (plural AVL trees)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Computer science"
      ],
      "glosses": [
        "A self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "self-balancing",
          "self-balancing"
        ],
        [
          "binary search",
          "binary search"
        ],
        [
          "tree",
          "tree"
        ],
        [
          "node",
          "node"
        ],
        [
          "height",
          "height"
        ],
        [
          "child",
          "child"
        ],
        [
          "subtree",
          "subtree"
        ],
        [
          "differ",
          "differ"
        ]
      ],
      "raw_glosses": [
        "(computer science) A self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "wikipedia": [
        "Evgenii Landis"
      ]
    }
  ],
  "word": "AVL tree"
}